KAJIAN TENTANG KONTRIBUSI CACING TANAH DAN PERANNYA TERHADAP LINGKUNGAN KAITANNYA DENGAN KUALITAS TANAH

Cacing Tanah atau Earthworm , merupakan makrofauna tanah yang saat ini banyak dibudidayakan untuk berbagai kepentingan. Namun sementara banyak orang yang tidak peduli dengan keberadaan nya dikarena dianggap tidak bermanfaat dan kurang menguntungkan. Fakta menunjukkan bahwa banyak perilaku petani dengan ketidak tahuan nya menggunakan pupuk kimia sintetis untuk untuk meningkatkan produk pertanian namun disisi lain banyak cacing tanah yang mati dikarenakan cacing tanah sangat sensitif terhadap bahan kimia tersebut. Kajian ilmiah ini bertujuan untuk mengungkap kejelasan mengenai peran cacing tanah terhadap lingkungan, hubungannya dengan kesuburan tanah. Kesuburan tersebut berhubungan dengan faktor fisik, kimia dan biologi tanah. Dari kajian ilmiah ini dapat memperjelas peran cacing tanah terhadap lingkungan dan dan menjaga kualitas serta sekaligus memberikan informasi dan warning bagi para petani untuk tidak menggunakan pupuk kimia. Kata Kunci: Cacing tanah, lingkungan, kualitas tanah

Towards an infinitary logic of domains : Abramsky logic for transition systems

We give a new characterization of sober spaces in terms of their completely distributive lattice of saturated sets. This characterization is used to extend Abramsky's results about a domain logic for transition systems. The Lindenbaum algebra generated by the Abramsky finitary logic is a distributive lattice dual to an SFP-domain obtained as a solution of a recursive domain equation. We prove that the Lindenbaum algebra generated by the infinitary logic is a completely distributive lattice dual to the same SFP-domain. As a consequence soundness and completeness of the infinitary logic is obtained for a class of transition systems that is computational interesting

Coalgebraic characterizations of context-free languages

Article / Letter to editorLeiden Inst Advanced Computer Science

Learning probabilistic languages by k-testable machines

Algorithms and the Foundations of Software technolog

Coalgebraic semantics of heavy-weighted automata

We study heavy-weighted automata, a generalization of weighted automata in which the weights of the transitions can be any formal power series. We define their semantics in three equivalent ways, and give some examples of how they can provide a more compact representation of certain power series than ordinary weighted automata

Coalgebraic semantics of heavy-weighted automata

We study heavy-weighted automata, a generalization of weighted automata in which the weights of the transitions can be any formal power series. We define their semantics in three equivalent ways, and give some examples of how they can provide a more compact representation of certain power series than ordinary weighted automata